Complexity-Restricted Advice Functions
نویسندگان
چکیده
منابع مشابه
Complexity-Restricted Advice Functions
We consider uniform subclasses of the nonuniform complexity classes de ned by Karp and Lipton via the notion of advice functions These subclasses are obtained by restricting the complexity of computing correct advice We also investigate the e ect of allowing advice functions of limited complexity to depend on the input rather than on the input s length Among other results using the notions desc...
متن کاملRestricted Complexity, General Complexity
Why has the problematic of complexity appeared so late? And why would it be justified? 1. The three principles of the rejection of complexity by 'classical science' Classical science rejected complexity in virtue of three fundamental explanatory principles: (1) The principle of universal determinism, illustrated by Laplace's Daemon, capable, thanks to his intelligence and extremely developed se...
متن کاملComplexity of Propositional Abduction for Restricted Sets of Boolean Functions
Abduction is a fundamental and important form of nonmonotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional abduction, where the knowledge base and the manifestation are represented by propositional formulae. The problem of deciding whether there exists an explanation ...
متن کاملOn the Advice Complexity of Online Problems
In this paper, we investigate to what extent the solution quality of online algorithms can be improved by allowing the algorithm to extract a given amount of information about the input. We consider the recently introduced notion of advice complexity where the algorithm, in addition to being fed the requests one by one, has access to a tape of advice bits that were computed by some oracle funct...
متن کاملKolmogorov-Loveland Sets and Advice Complexity Classes
Loveland complexity Loveland (1969) is a variant of Kolmogorov complexity, where it is asked to output separately the bits of the desired string, instead of the string itself. Similarly to the resource-bounded Kolmogorov sets we define Loveland sets. We highlight a structural connection between resource-bounded Loveland sets and some advice complexity classes. This structural connection enables...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1994
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539791200351